The VC dimension of k-fold union
نویسندگان
چکیده
The known O(dk log k) bound on the VC dimension of k-fold unions or intersections of a given concept class with VC dimension d is shown to be asymptotically tight.
منابع مشابه
k-Fold unions of low-dimensional concept classes
We show that 2 is the minimum VC dimension of a concept class whose k-fold union has VC dimension Ω(k log k).
متن کاملVC-Dimension of Sets of Permutations
We deene the VC-dimension of a set of permutations A S n to be the maximal k such that there exist distinct i 1 ; :::; i k 2 f1; :::; ng that appear in A in all possible linear orders, that is, every linear order of fi 1 ; :::; i k g is equivalent to the standard order of f(i 1); :::; (i k)g for at least one permutation 2 A. In other words, the VC-dimension of A is the maximal k such that for s...
متن کاملThe VC-dimension of graphs with respect to k-connected subgraphs
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its k-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that computing the VC-dimension is NP-complete and that it remains NP-complete for split graphs and for some subclasses of planar bipartite graphs in the cases k = 1 an...
متن کاملCompressing to VC Dimension Many Points
Note that the VC dimension of orthogonal rectangles is four and this is exactly the number of examples needed to represent the consistent orthogonal rectangle. A compression scheme of size k for a concept class C picks from any set of examples consistent with some concept in C a subset of up to k examples and this subset represents (via a mapping that that is specific to the class C) a hypothes...
متن کاملRIFIS Technical Report Complexity of Computing Generalized VC-Dimensions
In the PAC-learning model, the Vapnik-Chervonenkis (VC) dimension plays the key role to estimate the polynomial-sample learnability of a class of binary functions. For a class of multi-valued functions, the notion has been generalized in various ways. This paper investigates the complexity of computing some of generalized VC-dimensions: VC*dimension, *,-dimension, and SG-dimension. For each dim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 101 شماره
صفحات -
تاریخ انتشار 2007